A Sharpened Condition Number Estimate for the BPX Preconditioner of Elliptic Finite Element Problems on Highly Nonuniform Triangulations
نویسنده
چکیده
In this paper it is shown that for highly nonuniformly refined triangulations the condition number of the BPX preconditioner for elliptic finite element problems grows at most linearly in the depth of refinement. This is achieved by viewing the computational available version of the BPX preconditioner as an abstract additive Schwarz method with exact solvers. AMS CLASSIFICATION: 65F10, 65F35, 65N20, 65N30.
منابع مشابه
Adaptive Multilevel Techniques for Mixed Finite Element Discretizations of Elliptic Boundary Value Problems Technische Universit at M Unchen Cataloging Data : Adaptive Multilevel Techniques for Mixed Finite Element Discretizations of Elliptic Boundary Value Problems
We consider mixed nite element discretizations of linear second order elliptic boundary value problems with respect to an adaptively generated hierarchy of possibly highly nonuniform simplicial triangula-tions. By a well known postprocessing technique the discrete problem is equivalent to a modiied nonconforming discretization which is solved by preconditioned cg-iterations using a multilevel B...
متن کاملAdaptive Multilevel Techniques for Mixed Finite Element Discretizations of Elliptic Boundary Value Problems
We consider mixed nite element discretizations of linear second order elliptic boundary value problems with respect to an adaptively generated hierarchy of possibly highly nonuniform simplicial triangula-tions. By a well known postprocessing technique the discrete problem is equivalent to a modiied nonconforming discretization which is solved by preconditioned cg-iterations using a multilevel B...
متن کاملMultilevel Finite Element Preconditioning for √ 3 Refinement Jan
We develop a BPX-type multilevel method for the numerical solution of second order elliptic equations in R2 using piecewise linear polynomials on a sequence of triangulations given by regular √ 3 refinement. A multilevel splitting of the finest grid space is obtained from the nonnested sequence of spaces on the coarser triangulations using prolongation operators based on simple averaging proced...
متن کاملMultilevel finite element preconditioning for √3 refinement
We develop a BPX-type multilevel method for the numerical solution of second order elliptic equations in R using piecewise linear polynomials on a sequence of triangulations given by regular √ 3 refinement. A multilevel splitting of the finest grid space is obtained from the non-nested sequence of spaces on the coarser triangulations using prolongation operators based on simple averaging proced...
متن کاملA convergent finite element method with adaptive √ 3 refinement
We develop an adaptive finite element method (AFEM) using piecewise linears on a sequence of triangulations obtained by adaptive √ 3 refinement. The motivation to consider √ 3 refinement stems from the fact that it is a slower topological refinement than the usual red or red-green refinement, and that it alternates the orientation of the refined triangles, such that certain features or singular...
متن کامل